Boolean satisfiability problem - PDFSEARCH.IO - Document Search Engine

Boolean satisfiability problem
Results: 324

#	Item
101	Advanced Procedures for Hard Problems in Abstract Argumentation Johannes Peter Wallner Institute of Information Systems Vienna University of Technology Add to Reading List Source URL: www.dcs.kcl.ac.uk Language: English - Date: 2013-06-09 11:47:58 Critical thinking Arguments Logic Argumentation theory NP-complete Boolean satisfiability problem NP-hard Oracle machine Algorithm Theoretical computer science Applied mathematics Complexity classes
102	Algorithms Lecture 30: NP-Hard Problems [Fa’14] [I]n his short and broken treatise he provides an eternal example—not of laws, or even of method, for there is no method except to be very intelligent, but Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:23 Complexity classes Mathematical optimization Structural complexity theory Computability theory NP-hard NP-complete Boolean satisfiability problem Cook–Levin theorem P versus NP problem Theoretical computer science Computational complexity theory Applied mathematics
103	Journal of Artificial Intelligence Research606 Submitted 11/07; publishedSATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Add to Reading List Source URL: jair.org Language: English - Date: 2008-07-01 13:34:37 NP-complete problems Logic in computer science Electronic design automation Formal methods Boolean algebra Boolean satisfiability problem Algorithm Computational complexity theory Solver Theoretical computer science Applied mathematics Mathematics
104	PDF Document Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2012-05-29 03:59:19 Constraint programming Logic in computer science Automated theorem proving Electronic design automation NP-complete problems Satisfiability Modulo Theories Boolean satisfiability problem Uninterpreted function Decision problem Theoretical computer science Mathematics Applied mathematics
105	Topics in Knowledge Representation and Reasoning Optimizing Description Logic Subsumption Maryam Fazel-Zarandi DepartmentCompany Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2006-03-10 16:34:57 Logic in computer science Electronic design automation Formal methods NP-complete problems Reasoning Satisfiability Boolean satisfiability problem Description logic Knowledge representation and reasoning Theoretical computer science Science Mathematics
106	Resolution versus Search: Two Strategies for SAT Irina Rish and Rina Dechter Information and Computer Science University of California, Irvine Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2000-11-01 13:42:40 Mathematics Automated theorem proving Logic in computer science Boolean algebra Boolean satisfiability problem Electronic design automation Conjunctive normal form Unit propagation Resolution Theoretical computer science Constraint programming Applied mathematics
107	Probabilistically Estimating Backbones and Variable Bias: Experimental Overview ? Eric I. Hsu, Christian J. Muise, J. Christopher Beck, and Sheila A. McIlraith Department of Computer Science, University of Toronto {eihsu Add to Reading List Source URL: tidel.mie.utoronto.ca Language: English - Date: 2008-09-02 09:18:22 Estimation theory Statistical inference Bias Evaluation methods Boolean satisfiability problem Estimator Heuristic Mean squared error Bias of an estimator Statistics Information Theoretical computer science
108	Compilation of Planning to SAT Yiqiao Wang 1 Motivation Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2006-03-10 10:57:49 Logic in computer science Boolean algebra Constraint programming Electronic design automation Formal methods Boolean satisfiability problem Solver Satisfiability Davis–Putnam algorithm Theoretical computer science Mathematics Applied mathematics
109	Using an Expressive Description Logic: FaCT or Fiction? Ian R. Horrocks Medical Informatics Group Department of Computer Science University of Manchester Add to Reading List Source URL: www.cs.man.ac.uk Language: English - Date: 2007-07-26 07:49:27 Non-classical logic Model theory Philosophical logic Formal methods Transitive closure Modal logic Description logic Boolean satisfiability problem Satisfiability Logic Mathematics Mathematical logic
110	Processes and Continuous Change in a SAT-based Planner 1 Ji-Ae Shin Courant Institute, New York University, New York, NY 10012, USA Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2005-02-14 11:22:18 Mathematics Automated planning and scheduling Programming paradigms Operations research Planning Domain Definition Language Logic in computer science Boolean satisfiability problem Constraint satisfaction Linear programming Theoretical computer science Applied mathematics Constraint programming

UPDATE